#include<bits/stdc++.h>
using namespace std;
int n,a[100005],vis[100005];
int num,maxn;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    num=n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    maxn=a[n];
    for(int i=1;i<n;i++)
    {
        for(int j=1;j<n;j++)
        {
            if(a[i]<=a[j]&&vis[i]!=1)
            {
                vis[i]=1;
                num--;
            }
            if(a[i]>a[j]&&vis[i]!=1)
            {
                vis[i]=1;
                continue;
            }
        }
    }
    cout<<n-num;
    return 0;
}
